Global Solvability on Two-Step Compact Nilmanifolds
نویسندگان
چکیده
منابع مشابه
Geodesic Conjugacy in Two - Step Nilmanifolds
Two Riemannian manifolds are said to have C-conjugate geodesic flows if there exist an C diffeomorphism between their unit tangent bundles which intertwines the geodesic flows. We obtain a number of rigidity results for the geodesic flows on compact 2-step Riemannian nilmanifolds: For generic 2-step nilmanifolds the geodesic flow is C rigid. For special classes of 2-step nilmanifolds, we show t...
متن کاملDolbeault Cohomology of compact Nilmanifolds
Let M = G/Γ be a compact nilmanifold endowed with an invariant complex structure. Using a descending series associated to the complex structure and the Borel spectral sequences for the corresponding set of holomorphic fibrations, we prove a version of Nomizu’s Theorem for the Dolbeault cohomology of M .
متن کاملAnosov Automorphisms on Compact Nilmanifolds Associated with Graphs
We associate with each graph (S, E) a 2-step simply connected nilpotent Lie group N and a lattice Γ in N . We determine the group of Lie automorphisms of N and apply the result to describe a necessary and sufficient condition, in terms of the graph, for the compact nilmanifold N/Γ to admit an Anosov automorphism. Using the criterion we obtain new examples of compact nilmanifolds admitting Anoso...
متن کاملClosed Geodesics on Compact Nilmanifolds with Chevalley Rational Structure
We continue the study of the distribution of closed geodesics on nilmanifolds Γ\N , constructed from a simply connected 2-step nilpotent Lie group N with a left invariant metric and a lattice Γ in N . We consider a Lie group N with associated 2-step nilpotent Lie algebra N constructed from an irreducible representation of a compact semisimple Lie algebra g0 on a real finite dimensional vector s...
متن کاملOne-Step Consensus Solvability
While any fault-tolerant asynchronous consensus algorithm requires two communication steps even in failure-free executions, it is known that we can construct an algorithm terminating in one step for some good inputs (e.g. all processes propose a same value). In this paper, we present the necessary and sufficient constraint for the set of inputs for which we can construct an asynchronous consens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1983
ISSN: 0002-9947
DOI: 10.2307/1999551